htucker – A Matlab toolbox for tensors in hierarchical Tucker format

نویسندگان

  • Daniel Kressner
  • Christine Tobler
چکیده

The hierarchical Tucker format is a storage-efficient scheme to approximate and represent tensors of possibly high order. This paper presents a Matlab toolbox, along with the underlying methodology and algorithms, which provides a convenient way to work with this format. The toolbox not only allows for the efficient storage and manipulation of tensors but also offers a set of tools for the development of higher-level algorithms. Several examples for the use of the toolbox are given.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilevel preconditioning and low-rank tensor iteration for space-time simultaneous discretizations of parabolic PDEs

This paper addresses the solution of instationary parabolic evolution equations simultaneously in space and time. As a model problem we consider the heat equation posed on the unit cube in Euclidean space of moderately high dimension. An a priori stable minimal residual Petrov-Galerkin variational formulation of the heat equation in space-time results in a generalized least squares problem. Thi...

متن کامل

On the approximation of high-dimensional differential equations in the hierarchical Tucker format

The hierarchical Tucker format is a way to decompose a high-dimensional tensor recursively into sums of products of lower-dimensional tensors. The number of degrees of freedom in such a representation is typically many orders of magnitude lower than the number of entries of the original tensor. This makes the hierarchical Tucker format a promising approach to solve ordinary differential equatio...

متن کامل

Efficient MATLAB Computations with Sparse and Factored Tensors

In this paper, the term tensor refers simply to a multidimensional or N -way array, and we consider how specially structured tensors allow for efficient storage and computation. First, we study sparse tensors, which have the property that the vast majority of the elements are zero. We propose storing sparse tensors using coordinate format and describe the computational efficiency of this scheme...

متن کامل

Black Box Approximation of Tensors in Hierarchical Tucker Format

We derive and analyse a scheme for the approximation of order d tensors A ∈ R n×···×n in the hierarchical (H-) Tucker format, a dimension-multilevel variant of the Tucker format and strongly related to the TT format. For a fixed rank parameter k, the storage complexity of a tensor in H-Tucker format is O(dk 3 + dnk) and we present a (heuristic) algorithm that finds an approximation to a tensor ...

متن کامل

A Preliminary Report on the Development of MATLAB Tensor Classes for Fast Algorithm Prototyping

We describe three MATLAB classes for manipulating tensors in order to allow fast algorithm prototyping. A tensor is a multidimensional or N -way array. We present a tensor class for manipulating tensors which allows for tensor multiplication and “matricization.” We have further added two classes for representing tensors in decomposed format: cp tensor and tucker tensor. We demonstrate the use o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012